Linear programming model can explain respiration of fermentation products
نویسندگان
چکیده
منابع مشابه
Linear programming model can explain respiration of fermentation products
Many differentiated cells rely primarily on mitochondrial oxidative phosphorylation for generating energy in the form of ATP needed for cellular metabolism. In contrast most tumor cells instead rely on aerobic glycolysis leading to lactate to about the same extent as on respiration. Warburg found that cancer cells to support oxidative phosphorylation, tend to ferment glucose or other energy sou...
متن کاملCan utility optimization explain the demand for structured investment products ?
In this paper, we first show that for classical rational investors with correct beliefs and constant absolute or constant relative risk aversion, the utility gains from structured products over and above a portfolio consisting of the risk-free asset and the market portfolio are typically much smaller than their fees. This result holds irrespectively of whether the investors can continuously tra...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملFermentation Products of Cellulose
IN WORKING on the products resulting from the anaerobic decomposition of biologic waste material, the writers, with others (1), have observed that the reactions, which are brought about by bacteria, cause the formation of considerable amounts of gas. This gas is principally methane and carbon dioxide, with small amounts (3-5 per cent) of hydrogen and nitrogen, the latter probably from solution ...
متن کاملCombinatorial Linear Programming: Geometry Can Help
We consider a class A of generalized linear programs on the d-cube (due to Matoušek) and prove that Kalai’s subexponential simplex algorithm Random-Facet is polynomial on all actual linear programs in the class. In contrast, the subexponential analysis is known to be best possible for general instances in A. Thus, we identify a “geometric” property of linear programming that goes beyond all abs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0191803